Characterizing and computing minimal cograph completions
نویسندگان
چکیده
منابع مشابه
Reports in Informatics Characterizing and Computing Minimal Cograph Completions Characterizing and Computing Minimal Cograph Completions *
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is ...
متن کاملCharacterizing and Computing Minimal Cograph Completions
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is ...
متن کاملComputing and extracting minimal cograph completions in linear time ∗
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we characterize minimal cograph completions, and we give the following linear-time algorithms: one for extracting a minimal cograph completion from any given cograph completion of G, and one for d...
متن کاملMinimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph. This problem is closely related to the problem of adding an inclusion minimal set of edges to a graph to obtai...
متن کاملMinimal comparability completions
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a comparability graph, called a comparability completion of the input graph. Computing a comparability completion with the minimum possible number of added edges is an NP-hard problem. Our purpose here is to add an inclusion minimal set of edges to obtain a minimal comparability completion, which mean...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.01.016